Deterministic Consistency Checking of LP Constraints
نویسنده
چکیده
We provide a constraint based computational model of linear precedence as employed in the HPSG grammar formalism. An extended feature logic which adds a wide range of constraints involving precedence is described. A sound, complete and terminating deterministic constraint solving procedure is given. Deterministic computational model is achieved by weakening the logic such that it is sufficient for linguistic applications involving word-order. S u b j e c t areas : feature logic, constraint based grammars
منابع مشابه
Consistency checking for Euclidean spatial constraints: a dimension graph approach
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is pmposed to maintain the Euclidean spatial constraints among objects. The basic idea is to project the spatial constraints on both X and Y dimensions, and to construct a dimension graph on each dimension. Using a dimension graph representation transfonns the proble...
متن کاملChecking Behavioral Consistency Constraints for Pervasive Context in Asynchronous Environments
Context consistency checking, the checking of specified constraint on properties of contexts, is essential to contextaware applications. In order to delineate and adapt to dynamic changes in the pervasive computing environment, context-aware applications often need to specify and check behavioral consistency constraints over the contexts. This problem is challenging mainly due to the distribute...
متن کاملOn the consistency of cardinal direction constraints
We present a formal model for qualitative spatial reasoning with cardinal directions utilizing a co-ordinate system. Then, we study the problem of checking the consistency of a set of cardinal direction constraints. We introduce the first algorithm for this problem, prove its correctness and analyze its computational complexity. Using the above algorithm, we prove that the consistency checking ...
متن کاملEecient Algorithms for Networks of Quantitative Temporal Constraints
This paper describes two algorithms for networks of quantitative temporal constraints. The rst one is an incremental algorithm for checking the consistency of a set of constraints: it is based on the directional path consistency property, and it is a complete algorithm. The second algorithm relies on a property of shortest paths in a directional path consistent network. We prove this property a...
متن کاملEfficient Planning with State Trajectory Constraints
This paper introduces a general planning approach with state trajectory constraints, a language extension that has recently been introduced to PDDL for running the Fifth International Planning Competition in 2006. In our approach PDDL inputs with state trajectory constraints are translated into ordinary (fully instantiated) PDDL. It exploits the automata-based interpretation of the constraints,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995